package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution997 {
    public int findJudge(int n, int[][] trust) {
        return GraphUtils.findJudge(n, trust);
    }
}

public class leetcode997 {
    public static void main(String[] args) {
        Solution997 solution997 = new Solution997();

        int n = 2;
        int[][] trust = {{1, 2}};
        System.out.println(solution997.findJudge(n, trust));

        int n1 = 3;
        int[][] trust1 = {{1, 3}, {2, 3}};
        System.out.println(solution997.findJudge(n1, trust1));

        int n2 = 3;
        int[][] trust2 = {{1, 3}, {2, 3}, {3, 1}};
        System.out.println(solution997.findJudge(n2, trust2));
    }
}
